Type Theoretic Foundations of Programming Languages
نویسنده
چکیده
Concrete +(num[5]; +(num[4]; num[3])) 5 + 4 + 3 ^(str[john]; ^(x; str[doe])) ’john’ ^ x ^ ’doe’ let(hours; num[24]; +(hours; num[33]) let hours be 24 in hours+33 Figure 2: Example MiniLang Expressions
منابع مشابه
A Tutorial on Proof Theoretic Foundations of Logic Programming
Abstract logic programming is about designing logic programming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expressive logic programming languages, endowed with a rich meta theory. This tutorial intends to expose the main ideas of this discipline in the most direct and simple way.
متن کاملUnivalent Foundations Project
While working on the completion of the proof of the Bloch-Kato conjecture I have thought a lot about what to do next. Eventually I became convinced that the most interesting and important directions in current mathematics are the ones related to the transition into a new era which will be characterized by the widespread use of automated tools for proof construction and verification. I have star...
متن کاملModal Proofs As Distributed Programs
We develop a new foundation for distributed programming languages by defining an intuitionistic, modal logic and then interpreting the modal proofs as distributed programs. More specifically, the proof terms for the various modalities have computational interpretations as remote procedure calls, commands to broadcast computations to all nodes in the network, commands to use portable code, and f...
متن کاملChapter 4 Regular Types for Active Objects *
Previous work on type-theoretic foundations for object-oriented programming languages has mostly focused on applying or extending functional type theory to functional “objects.” This approach, while benefiting from a vast body of existing literature, has the disadvantage of dealing with state change either in a roundabout way or not at all, and completely sidestepping issues of concurrency. In ...
متن کاملProgramming language semantics in foundational type theory
languages --e.g., theoretical foundations, syntax, semantics, types, scope of Brief history of programming languages, Syntax, Semantics, Essentials, Paradigms Expression evaluation orders, Types, Recursion, Higher-order programming Programming Distributed Computing Systems: A Foundational Approach. type theory and the foundations of functional programming languages. Secondly, I would like to th...
متن کامل